A local multiobjective optimization algorithm using neighborhood field
نویسندگان
چکیده
A new local search algorithm for multiobjective optimization problems is proposed to find the global optima accurately and diversely. This paper models the cooperatively local search as a potential field, which is called neighborhood field model (NFM). Using NFM, a new Multiobjective Neighborhood Field Optimization (MONFO) algorithm is proposed. In MONFO, the neighborhood field can drive each individual moving towards the superior neighbor and away from the inferior neighbor. MONFO is compared with other popular multiobjective algorithms under twelve test functions. Intensive simulations show that MONFO is able to deliver promising results in the respects of accuracy and diversity, especially for multimodal problems.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملXergy analysis and multiobjective optimization of a biomass gasification-based multigeneration system
Biomass gasification is the process of converting biomass into a combustible gas suitable for use in boilers, engines, and turbines to produce combined cooling, heat, and power. This paper presents a detailed model of a biomass gasification system and designs a multigeneration energy system that uses the biomass gasification process for generating combined cooling, heat, and electricity. Energy...
متن کاملUse of biased neighborhood structures in multiobjective memetic algorithms
In this paper, we examine the use of biased neighborhood structures for local search in multiobjective memetic algorithms. Under a biased neighborhood structure, each neighbor of the current solution has a different probability to be sampled in local search. In standard local search, all neighbors of the current solution usually have the same probability because they are randomly sampled. On th...
متن کاملA Simple yet Efficient Multiobjective Combinatorial Optimization Method Using Decomposition and Pareto Local Search
Combining ideas from evolutionary algorithms, decomposition approaches and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: MoMad. It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MoMad evolves three populations: popula...
متن کاملVery Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is almost no study of VLSNS for multiobjective optimization. We show in this paper that this technique is very efficient for the resolution of multiobjective combinatorial optimization problems. Two problems are considered: the multiobjective multidimensional knapsack pr...
متن کامل